Revisiting randomized parallel load balancing algorithms
نویسندگان
چکیده
منابع مشابه
Revisiting Randomized Parallel Load Balancing Algorithms
We deal with the well studied allocation problem of assigning n balls to n bins so that the maximum number of balls assigned to the same bin is minimized. We focus on randomized, constantround, distributed, asynchronous algorithms for this problem. Adler et al. [1] presented lower bounds and upper bounds for this problem. A similar lower bound appears in Berenbrink et al. [3]. The lower bound i...
متن کاملParallel randomized load balancing
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds Θ(logn/ log logn) balls with high probability. More recently, Azar et al. analyzed the following process: randomly choose d bins for each ball, and then place the balls, one by one, into the least full bin from its d choices [2]. They show that after all n balls have been placed,...
متن کاملLoad Balancing Strategies for Parallel SAMR Algorithms
Highly resolved solutions of partial differential equations are important in many areas of science and technology nowadays. Only adaptive mesh refinement methods reduce the necessary work sufficiently allowing the calculation of realistic problems. Blockstructured SAMR methods are well-suited for the time-explicit computation of large-scale dynamical problems, but still require parallelization ...
متن کاملNearest-neighbor algorithms for load-balancing in parallel computers
With nearest neighbor load balancing algorithms, a processor makes balancing decisions based on localized workload information and manages workload migrations within its neighborhood. This paper compares a couple of fairly well-known nearest neighbor algorithms , the dimension-exchange (DE, for short) and the diiusion (DF, for short) methods and their several variants|the average dimension-exch...
متن کاملParallel Performance of Adaptive Algorithms with Dynamic Load Balancing
Parallelization of adaptive algorithms leads to problems with parallel efficiency. Adaptation is a method which introduces dynamic perturbations to computational environment. This in turn causes problems with proper load balance. To ensure proper efficiency of a parallel simulation it is necessary to perform load balancing whenever certain threshold of load balance is breached. In this paper au...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.01.009